Some rainbow problems in graphs have complexity equivalent to satisfiability problems
نویسندگان
چکیده
منابع مشابه
On Some Problems in Satisfiability Solving
Satisfiability solving is the problem of determining whether a given formula has a solution. The most ubiquitous and well-studied satisfiability problem is propositional satisfiability (SAT), in which all variables are Boolean. In recent years, the field of satisfiability modulo theories (SMT) has extended methods in SAT solving to accommodate existential first order formulas with non-Boolean v...
متن کاملOn the complexity of some bondage problems in graphs
The paired bondage number (total restrained bondage number, independent bondage number, k-rainbow bondage number) of a graph G, is the minimum number of edges whose removal from G results in a graph with larger paired domination number (respectively, total restrained domination number, independent domination number, k-rainbow domination number). In this paper we show that the decision problems ...
متن کاملThe Complexity of Minimal Satisfiability Problems
A dichotomy theorem for a class of decision problems is a result asserting that certain problems in the class are solvable in polynomial time, while the rest are NP-complete. The first remarkable such dichotomy theorem was proved by Schaefer in 1978. It concerns the class of generalized satisfiability problems SatðSÞ, whose input is a CNFðSÞ-formula, i.e., a formula constructed from elements of...
متن کاملComplexity of Generalized Satisfiability Counting Problems
The class of generalized satisfiability problems, introduced in 1978 by Schaefer, presents a uniform way of studying the complexity of satisfiability problems with special conditions. The complexity of each decision and counting problem in this class depends on the involved logical relations. In 1979, Valiant defined the class *P, the class of functions definable as the number of accepting comp...
متن کاملThe exponential complexity of satisfiability problems
of the Dissertation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xi Chapter
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Transactions in Operational Research
سال: 2020
ISSN: 0969-6016,1475-3995
DOI: 10.1111/itor.12847